Interval volume decomposer: a topological approach to volume traversal
نویسندگان
چکیده
The Interval Volume Decomposer (IVD) is an interface for decomposing an entire volume into interval volumes each of which characterizes a distinctive volume feature. The advantage of the IVD is that it allows us to look inside the volume by peeling interval volumes from outside to inside not only interactively but also automatically. This is achieved due to the rigorous analysis of nested structures of the decomposed interval volumes by constructing a level-set graph that delineates isosurface transitions according to the scalar field. A robust algorithm for computing such level-set graphs is introduced in order to extract significant structures in the volume by putting together local interval volumes into a finite number of global groups. Several decomposition examples of medical and simulated datasets are demonstrated so that the present interface effectively traverses the underlying structures of the volume.
منابع مشابه
Watertight ray traversal with reduced precision
Reduced precision bounding volume hierarchies and ray traversal can significantly improve the efficiency of ray tracing through low-cost dedicated hardware. A key approach to enabling reduced precision computations during traversal is to translate the ray origin closer to the bounding volume hierarchy node after each traversal step. However, this approach precludes sharing of intersection compu...
متن کاملVS: A surface-based system for topological analysis, quantization and visualization of voxel data
VS is a simple system consisting of several techniques for various volumetric problems. Based on the marching cubes algorithm, it operates with one space sweep through the voxels and extracts all topological information: detection of all isosurfaces, partitioning the data into connected components on the basis of surface connectivity, and association of surfaces with any internal surfaces to ar...
متن کاملReview and Comparative Study of Ray Traversal Algorithms on a Modern GPU Architecture
In this paper we present a chronological review of five distinct data structures commonly found in literature and ray tracing systems: Bounding Volume Hierarchies (BVH), Octrees, Uniform Grids, KD-Trees, and Bounding Interval Hierarchies (BIH). This review is then followed by an extensive comparative study of six different ray traversal algorithms implemented on a modern Kepler CUDA GPU archite...
متن کاملThe effects of interval aerobic training on mesenchymal biomarker gene expression, the rate of tumor volume, and cachexia in mice with breast cancer
Objective(s): It seems that regular exercise can have inhibitory effects on the progression of breast cancer. This study, therefore, aimed to investigate the influences of interval aerobic training on mesenchymal biomarker gene expression, muscle cachexia, and tumor volume changes in mice with breast cancer.Materials and Methods: Thirty-...
متن کاملShallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays
Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths that are very incoherent by construction. We therefore investigate the use of SIMD instructions to accelerate incoherent rays. SIMD is used in the hierarchy construction, the tree traversal and the leaf intersection. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005